Batch arrival queue with N-policy and single vacation

نویسندگان

  • Soon Seok Lee
  • Ho Woo Lee
  • Seung Hyun Yoon
  • Kyung C. Chae
چکیده

We consider an MXI ell queueing system with N-policy and single vacation. As soon as the system becomes empty, the server leaves the system for a vacation of random length 11: When he returns from the vacation, if the system size is greater than or equal to a pretermined value N(threshold), he begins to serve the customers. If not, the server waits in the system until the system size reaches or exceeds N We derive the system size distribution and show that the system size distribution decomposes into two random variables one of which is the system size of ordinary MXI ell queue. The interpretation of the other random variab1e will also be provided. We also derive the queue waiting time distribution of an arbitrary customer. Finally we develop a procedure to find the optimal stationary operating policy under a linear cost structure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unreliable bulk retrial queues with delayed repairs and modified vacation policy

The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...

متن کامل

Multiple vacation policy for MX/Hk/1 queue with un-reliable server

This paper studies the operating characteristics of an MX/Hk/1 queueing system under multiple vacation policy. It is assumed that the server goes for vacation as soon as the system becomes empty. When he returns from a vacation and there is one or more customers waiting in the queue, he serves these customers until the system becomes empty again, otherwise goes for another vacation. The brea...

متن کامل

ANALYSIS OF RENEWAL INPUT STATE DEPENDENT VACATION QUEUE WITH $N$-POLICY

This paper analyzes renewal input state dependent queue with $N$- policy wherein the server takes exactly one vacation. Using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. Various performance measures has been presented. Finally, some numerical  computations in the form of graphs are presented to show the par...

متن کامل

FINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION

A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.  

متن کامل

AN M/G/1 QUEUE WITH REGULAR AND OPTIONAL PHASE VACATION AND WITH STATE DEPENDENT ARRIVAL RATE

We consider an M/G/1 queue with regular and optional phase vacation and withstate dependent arrival rate. The vacation policy is after completion of service if there are no customers in the system, the server takes vacation consisting of K -phases, each phase is generally distributed. Here the first phase is compulsory where as the other phases are optional. For this model the supplementary var...

متن کامل

Steady-State Queue Length Analysis of a Batch Arrival Queue under N-Policy with Single Vacation and Setup Times

This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length V . When he returns, if the queue length reaches or exceeds threshold ( 1) N N  , the server is immediately turned on but is temporarily unava...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 22  شماره 

صفحات  -

تاریخ انتشار 1995